Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
نویسندگان
چکیده
We provide several machine-independent characterizations of deterministic complexity classes in the model of computation proposed by L. Blum, M. Shub and S. Smale. We provide a characterization of partial recursive functions over any arbitrary structure. We show that polynomial time over an arbitrary structure can be characterized in terms of ∗These authors has been supported City University of Hong Kong SRG grant 7001290.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملComputability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
We provide several machine-independent characterizations of deterministic complexity classes in the model of computation proposed by L. Blum, M. Shub and S. Smale. We provide a characterization of partial recursive functions over any arbitrary structure. We show that polynomial time computable functions over any arbitrary structure can be characterized in term of safe recursive functions. We sh...
متن کاملSafe Recursion Over an Arbitrary Structure: PAR, PH and DPH
Considering the Blum, Shub, and Smale computational model for real numbers, extended by Poizat to general structures, classical complexity can be considered as the restriction to finite structures of a more general notion of computability and complexity working over arbitrary structures. In a previous paper, we showed that the machine-independent characterization of Bellantoni and Cook of seque...
متن کاملMatrix Form of Polynomial Representation Oriented towards Fast Parallel Real Root Isolation
The problem of parallelization of the well known family of algorithms to isolate polynomials' real roots is considered. Known complexity of sequential and parallel algorithms is O(n 5 L(nd) 2) where n is the degree of the given polynomial, d is the maximum of absolute values of coeecients and L(v) is the bit length of an arbitrary precision integer v. It is shown that with matrix form of polyno...
متن کاملComputational complexity of an optical model of computation
We investigate the computational complexity of an optically inspired model of computation. The model is called the continuous space machine and operates in discrete timesteps over a number of two-dimensional complexvalued images of constant size and arbitrary spatial resolution. We define a number of optically inspired complexity measures and data representations for the model. We show the grow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 15 شماره
صفحات -
تاریخ انتشار 2005